/*
*	ID : pallab81
* 	PROG : 672
* 	LANG : C++
* 	2012-06-15-15.11.52 Friday
*
* 	"I have not failed, I have just found 10000 ways that won't work.
*/

#include <iostream>
#include <algorithm>
#include <vector>
#include <sstream>
#include <fstream>
#include <string>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <stack>
#include <functional>
#include <bitset>
#include <iomanip>

#include <ctime>
#include <cassert>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <climits>
#include <cstring>
#include <cstdlib>

using namespace std;


#define foR(i1,st,ed) for(int i1 = st , j1 = ed ; i1 < j1 ; ++i1 )
#define fo(i1,ed) foR( i1 , 0 , ed )
#define foE(i1,st,ed) foR( i1, st, ed+1 )
#define foit(i, x) for (typeof((x).begin()) i = (x).begin(); i != (x).end(); i++)
#define bip system("pause")
#define Int long long
#define pb push_back
#define SZ(X) (int)(X).size()
#define LN(X) (int)(X).length()
#define mk make_pair
#define SET( ARRAY , VALUE ) memset( ARRAY , VALUE , sizeof(ARRAY) )
#define line puts("")

template<class T1>
inline void debug(T1 _x) {
    cout<<_x<<'\n';
}
template<class T1, class T2>
inline void debug(T1 _x,T2 _y) {
    cout<<_x<<' '<<_y<<'\n';
}
template<class T1, class T2, class T3>
inline void debug(T1 _x,T2 _y,T3 _z) {
    cout<<_x<<' '<<_y<<' '<<_z<<'\n';
}
template<class T1, class T2, class T3, class T4>
inline void debug(T1 _x,T2 _y,T3 _z,T4 _zz) {
    cout<<_x<<' '<<_y<<' '<<_z<<' '<<_zz<<'\n';
}
template< class T1>
inline void debug(T1 _array,int _size) {
    cout<<"[";
    for (int i=0; i<_size; ++i) {
        cout<<' '<<_array[i];
    }
    puts(" ]");
}
inline bool CI(int &_x) {
    return scanf("%d",&_x)==1;
}
inline bool CI(int &_x, int &_y) {
    return CI(_x)&&CI(_y) ;
}
inline bool CI(int &_x, int &_y, int &_z) {
    return CI(_x)&&CI(_y)&&CI(_z) ;
}
inline bool CI(int &_x, int &_y, int &_z, int &_zz) {
    return CI(_x)&&CI(_y)&&CI(_z)&&CI(_zz) ;
}
inline void wait( double seconds ) {
    double endtime = clock()+( seconds* CLOCKS_PER_SEC );
    while( clock() < endtime ) {
        ;
    }
}

struct Node {
    int Ti;
    int Pi;
    int Si;
    Node( int Ti=0, int Pi=0, int Si=0):
        Ti(Ti),Pi(Pi),Si(Si) {
        ;
    }
};

namespace In {
int N,K,T;
Node vi[101];
int ppi[30005][105];
inline void Read() {
    CI(N,K,T);
    fo(i,N) {
        CI(vi[i].Ti);
    }
    fo(i,N) {
        CI(vi[i].Pi);
    }
    fo(i,N) {
        CI(vi[i].Si);
    }
    SET(ppi,0);
    fo(i,N) {
        ppi[ vi[i].Ti ][ vi[i].Si ]+= vi[i].Pi;
    }
}

}
#define open 1
#define close 0

namespace Algo {
int dpprv[105];
int dpnxt[105];
// time , state of openness, door status[ 0 = close, 1 = open
int go() {
    fill(dpnxt,dpnxt+105, -1023456789);

    dpnxt[0]=0;
    for(int i=1;i<=In::T;++i){
        memcpy(dpprv, dpnxt, sizeof(dpnxt) );
        for(int j=0;j<=In::K;++j){
            if( j-1>=0 )dpnxt[j] = max(dpnxt[j], dpprv[j-1]);
            if( j+1<=In::K )dpnxt[j] = max(dpnxt[j], dpprv[j+1]);
            dpnxt[j]+= In::ppi[i][j];
        }

    }
    return *max_element( dpnxt, dpnxt+105 );
}

}

inline void Solve() {
    In::Read();
    int ret=Algo::go();
    cout<<ret<<"\n";
}
#define FILE
//#define showCase

int main() {
#ifdef FILE
    freopen("/home/xerxes/Documents/672/in","rt",stdin);
#endif

    int tt;
    CI(tt);
    foE(i,1,tt) {
#ifdef showCase
        cout<<"Case "<<i<<": ";
#endif
        if(i!=1)putchar('\n');
        Solve();
    }


    return 0;
}
